package com.gorkr.hot100.simple;

import org.junit.jupiter.api.Test;

/**
 * @author gorkr
 * @date 2022/03/10 21:22
 **/
public class L70 {
    public int climbStairs(int n) {
        if(n==1) {
            return 1;
        }
        if(n==2) {
            return 2;
        }

        int[] dp = new int[n+1];
        // base
        dp[1] = 1;
        dp[2] = 2;
        for(int i = 3; i<=n; i++){
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];

    }

    @Test
    public void test(){
        System.out.println(climbStairs(4));
    }
}
    